Free‐will arbitrary time consensus protocols with diffusive coupling
نویسندگان
چکیده
In this article, free-will arbitrary time consensus protocols are proposed for multi-agent systems with single- and double- (possibly higher-order) integrator dynamics, respectively, switching) connected interaction graphs bounded matched disturbances. Under the laws, an average is achieved in a prespecified regardless of initial conditions or any other design parameters. Further, laws case no disturbances smooth, they distributed sense that information only communicated locally between neighboring agents. Finally, simulation results also provided to illustrate theoretical and, application formation control mobile agents presented.
منابع مشابه
Stochastic stability of continuous time consensus protocols
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow, both cooperative and noncooperative interactions, networks under weak stochastic forcing, and those whose topology and strength of connections may vary in time. The graph theoretic interpretatio...
متن کاملFitzHugh-Nagumo equations with generalized diffusive coupling.
The aim of this work is to investigate the dynamics of a neural network, in which neurons, individually described by the FitzHugh-Nagumo model, are coupled by a generalized diffusive term. The formulation we are going to exploit is based on the general framework of graph theory. With the aim of defining the connection structure among the excitable elements, the discrete Laplacian matrix plays a...
متن کاملConsensus protocols for discrete-time multi-agent systems with time-varying delays
This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm pro...
متن کاملDistributed Design of Finite-time Average Consensus Protocols
In this paper, we are interested in the finite-time average consensus problem for multi-agent systems or wireless sensor networks. This issue is formulated in a discrete-time framework by utilizing a linear iteration scheme, where each node repeatedly updates its value as a weighted linear combination of its own value and those of its neighbors. Unlike most of research in literature, this work ...
متن کاملMessage and time efficient consensus protocols for synchronous distributed systems
For a synchronous distributed system of n processes with up to t potential and f actual crash failures, where (t < n − 1, f t), the time lower bound for a protocol to achieve consensus is min(t + 1, f + 2) rounds. Currently, most researches in this field focus on the time efficiency of consensus protocols. This paper proposes consensus protocols for synchronous distributed systems that achieve ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2022
ISSN: ['1049-8923', '1099-1239']
DOI: https://doi.org/10.1002/rnc.6267